The electric vehicle routing problem with partial recharge and vehicle recycling

Abstract In this paper, a new variant of the electric vehicle (EV) routing problem, which considers heterogeneous EVs, partial recharge, and recycling, is investigated based on logistic companies' practical operation. A mixed integer linear programming (MILP) model proposed to formulate problem. For small-scale scenarios, commercial solver, e.g., CPLEX, leveraged. large-scale instances faced by applications, hybrid metaheuristic designed through integrating modified Greedy Algorithm with Variable Neighborhood Search (VNS). The algorithm was tested real-world from JD, an e-commerce enterprise in China. Computational results indicate that recharge recycling can save costs effectively. It also shows number charging stations important factor for application EVs.